A Characterisation of Multiply Recursive Functions with Higman’s Lemma
Identifieur interne : 00AA67 ( Main/Exploration ); précédent : 00AA66; suivant : 00AA68A Characterisation of Multiply Recursive Functions with Higman’s Lemma
Auteurs : Héléne Touzet [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We prove that string rewriting systems which reduce by Hig-man’s lemma exhaust the multiply recursive functions. This result provides a full characterisation of the expressiveness of Higman’s lemma when applied to rewriting theory. The underlying argument of our construction is to connect the order type and the derivation length via the Hardy hierarchy.
Url:
DOI: 10.1007/3-540-48685-2_13
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000C84
- to stream Istex, to step Curation: 000C76
- to stream Istex, to step Checkpoint: 002453
- to stream Main, to step Merge: 00B119
- to stream Main, to step Curation: 00AA67
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Characterisation of Multiply Recursive Functions with Higman’s Lemma</title><author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Héléne" last="Touzet">Héléne Touzet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:367B432ADDA339A517B9ED4F0487489D8D872FC6</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1007/3-540-48685-2_13</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-RFCVRWP0-P/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000C84</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000C84</idno><idno type="wicri:Area/Istex/Curation">000C76</idno><idno type="wicri:Area/Istex/Checkpoint">002453</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002453</idno><idno type="wicri:doubleKey">0302-9743:1999:Touzet H:a:characterisation:of</idno><idno type="wicri:Area/Main/Merge">00B119</idno><idno type="wicri:Area/Main/Curation">00AA67</idno><idno type="wicri:Area/Main/Exploration">00AA67</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Characterisation of Multiply Recursive Functions with Higman’s Lemma</title><author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Héléne" last="Touzet">Héléne Touzet</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LIFL - Université Lille 1, 59 655, Villeneuve d’Ascq</wicri:regionArea><orgName type="university">Université Lille I - Sciences et technologies</orgName><placeName><settlement type="city">Lille</settlement><region type="region" nuts="2">Hauts-de-France</region><region type="old region" nuts="2">Nord-Pas-de-Calais</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We prove that string rewriting systems which reduce by Hig-man’s lemma exhaust the multiply recursive functions. This result provides a full characterisation of the expressiveness of Higman’s lemma when applied to rewriting theory. The underlying argument of our construction is to connect the order type and the derivation length via the Hardy hierarchy.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Hauts-de-France</li><li>Nord-Pas-de-Calais</li></region><settlement><li>Lille</li></settlement><orgName><li>Université Lille I - Sciences et technologies</li></orgName></list><tree><country name="France"><region name="Hauts-de-France"><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Héléne" last="Touzet">Héléne Touzet</name></region><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Héléne" last="Touzet">Héléne Touzet</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00AA67 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00AA67 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:367B432ADDA339A517B9ED4F0487489D8D872FC6
|texte= A Characterisation of Multiply Recursive Functions with Higman’s Lemma
}}
| This area was generated with Dilib version V0.6.33. |  |